An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes
نویسندگان
چکیده
منابع مشابه
The WHILE Hierarchy of Program Schemes Is Infinite
We exhibit a sequence Sn (n ≥ 0) of while program schemes, i. e., while programs without interpretation, with the property that the while nesting depth of Sn is n, and prove that any while program scheme which is scheme equivalent to Sn, i. e., equivalent for all interpretations over arbitrary domains, has while nesting depth at least n. This shows that the while nesting depth imposes a strict ...
متن کاملa swot analysis of the english program of a bilingual school in iran
با توجه به جایگاه زبان انگلیسی به عنوان زبانی بین المللی و با در نظر گرفتن این واقعیت که دولت ها و مسئولان آموزش و پرورش در سراسر جهان در حال حاضر احساس نیاز به ایجاد موقعیتی برای کودکان جهت یاد گیری زبان انگلیسی درسنین پایین در مدارس دو زبانه می کنند، تحقیق حاضر با استفاده از مدل swot (قوت ها، ضعف ها، فرصتها و تهدیدها) سعی در ارزیابی مدرسه ای دو زبانه در ایران را دارد. جهت انجام این تحقیق در م...
15 صفحه اولPolynomial Time Approximation Schemes for Class-Constrained Packing Problems
We consider variants of the classic bin packing and multiple knapsack problems, in which sets of items of di erent classes (colours) need to be placed in bins; the items may have di<erent sizes and values. Each bin has a limited capacity, and a bound on the number of distinct classes of items it can accommodate. In the class-constrained multiple knapsack (CCMK) problem, our goal is to maximize ...
متن کاملPolynomial-Time Approximation Schemes
Let Π be an NP-hard optimization problem, and let A be an approximation algorithm for Π. For an instance I of Π, let A(I) denote the objective value when running A on I, and let OPT (I) denote the optimal objective value. The approximation ratio of A for the instance I is RA(I) = A(I)/OPT (I), thus, when Π is minimization (maximization) problem RA(I) ≥ 1 (RA(I) ≤ 1). A polynomial time approxima...
متن کاملPolynomial-Time Approximation Schemes
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-connectivity survivable-network design, and subset TSP. The schemes run in O(n log n) time for graphs embedded on both orientable and nonorientable surfaces. This work generalizes the PTAS frameworks of Borradaile, Klein, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2005
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-005-1230-6